Bayesian Probabilistic Power Flow Analysis Using Jacobian Approximate Bayesian Computation
نویسندگان
چکیده
منابع مشابه
Bayesian Probabilistic Power Flow Analysis Using Jacobian Approximate Bayesian Computation
A probabilistic power flow (PPF) study is an essential tool for the analysis and planning of a power system when specific variables are considered as random variables with particular probability distributions. The most widely used method for solving the PPF problem is Monte Carlo simulation (MCS). Although MCS is accurate for obtaining the uncertainty of the state variables, it is also computat...
متن کاملApproximate Bayesian Computation
Just when you thought it was safe to go back into the water, I’m going to complicate things even further. The Nielsen-Wakely-Hey [5, 3, 4] approach is very flexible and very powerful, but even it doesn’t cover all possible scenarios. It allows for non-equilibrium scenarios in which the populations from which we sampled diverged from one another at different times, but suppose that we think our ...
متن کاملAdaptive approximate Bayesian computation
Sequential techniques can enhance the efficiency of the approximate Bayesian computation algorithm, as in Sisson et al.’s (2007) partial rejection control version. While this method is based upon the theoretical works of Del Moral et al. (2006), the application to approximate Bayesian computation results in a bias in the approximation to the posterior. An alternative version based on genuine im...
متن کاملApproximate Bayesian Computation
Approximate Bayesian computation (ABC) constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices amon...
متن کاملAutomatic Sampler Discovery via Probabilistic Programming and Approximate Bayesian Computation
We describe an approach to automatic discovery of samplers in the form of human interpretable probabilistic programs. Specifically, we learn the procedure code of samplers for one-dimensional distributions. We formulate a Bayesian approach to this problem by specifying an adaptor grammar prior over probabilistic program code, and use approximate Bayesian computation to learn a program whose exe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2018
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2018.2810641